Innovative Evolutionary Algorithm Approach for Class-Teacher Timetabling Problem
نویسندگان
چکیده
This paper presents the application of genetic algorithms (GAs) as a means of inducing solutions to the ClassTeacher Timetabling Problem (CTTP). Timetabling problem in almost all research focus on solving the hard constraints. This is an attempt to satisfy as many soft constraints as possible, as soft constraints are varying in nature. Initially the population is created depending on the number of rooms and distribution of subjects with no clashes of a particular professor. The application of genetic algorithm to this domain is divided into 3-phases, which provide timetables that meet the hard constraints during the first phase. In the next phase different sets, which represent population satisfying single soft constraints from group of soft constraints is created and in the last phase we obtain the desired timetable by applying different soft constraints in the form of Set Operations. This provides flexibility in adding or removing soft constraints easily.
منابع مشابه
A discrete-event optimization framework for mixed-speed train timetabling problem
Railway scheduling is a complex task of rail operators that involves the generation of a conflict-free train timetable. This paper presents a discrete-event simulation-based optimization approach for solving the train timetabling problem to minimize total weighted unplanned stop time in a hybrid single and double track railway networks. The designed simulation model is used as a platform for ge...
متن کاملUniversal Method for Solving Timetabling Problems Based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and employs tabu search to speed up the solution finding...
متن کاملUsing fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملUniversal Method for Timetable Construction based on Evolutionary Approach
Timetabling problems are often hard and timeconsuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and operates on two levels – first-level evolutionary algorithm tries ...
متن کاملA Potts Neural Network Heuristic for the Class/Teacher Timetabling Problem
Timetabling problems emerge in many variations [9], depending on the nature of the assignments involved (exam timetabling, course timetabling, school timetabling and others), as well as, the characteristics of the institution and the set of constraints assumed. In this communication we focus on a particular school timetabling problem the Class/Teacher Timetabling Problem (CTTP) that will be des...
متن کامل